uly Parallel u g of

نویسندگان

  • Yeong-Ho Yu
  • Robert F. Simmons
چکیده

Understanding a text requires two basic tasks: making inferences at several levels of knowledge and composing a global interpretation of the given text from those various types of inferences. Since making inferences at each level demands an extensive computations, there have been several attempts to use parallel inference mechanisms such as parallel marker passing (PMP) to increase the productivity of the inference mecha nism. Such a mechanism, when used with many local processors, is capable of making inferences in parallel. However, it often poses a large burden on the task of composing the global interpretation by producing a number of meaningless inferences which should be filtered out. Therefore, the increased productivity of the inference mechanism causes the slow down of the task of forming the global interpretation and makes it the bottleneck of the whole system. Our system, TRUE, effectively solves this problem with the Constrained Marker Passing mechanism. The new mechanism not only allows the system to make necessary inferences in parallel, but also provides a way to compose the global interpretation in parallel. Therefore, the system is truly parallel, and does not suffer from any single bottleneck.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gender differences in health of EU10 and EU15 populations: the double burden of EU10 men

This study compares gender differences in Healthy Life Years (HLY) and unhealthy life years (ULY) between the original (EU15) and new member states (EU10). Based on the number of deaths, population and prevalence of activity limitations from the Statistics of Living and Income Conditions Survey (SILC) survey, we calculated HLY and ULY for the EU10 and EU15 in 2006 with the Sullivan method. We u...

متن کامل

Zagreb, multiplicative Zagreb Indices and Coindices of ‎graphs

‎Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The first, second and third Zagreb indices of G are respectivly defined by: $M_1(G)=sum_{uin V} d(u)^2, hspace {.1 cm} M_2(G)=sum_{uvin E} d(u).d(v)$ and $ M_3(G)=sum_{uvin E}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in G and uv is an edge of G connecting the vertices u and v. Recently, the first and second m...

متن کامل

Computing GA4 Index of Some Graph Operations

The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G   u v    , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...

متن کامل

On generalized left (alpha, beta)-derivations in rings

Let $R$ be a 2-torsion free ring and $U$ be a square closed Lie ideal of $R$. Suppose that $alpha, beta$ are automorphisms of $R$. An additive mapping $delta: R longrightarrow R$ is said to be a Jordan left $(alpha,beta)$-derivation of $R$ if $delta(x^2)=alpha(x)delta(x)+beta(x)delta(x)$ holds for all $xin R$. In this paper it is established that if $R$ admits an additive mapping $G : Rlongrigh...

متن کامل

On the property $U$-($G$-$PWP$) of acts

In this paper first of all we introduce Property $U$-($G$-$PWP$) of acts, which is an extension of Condition $(G$-$PWP)$ and give some general properties. Then we give a characterization of monoids when this property of acts implies some others. Also we show that the strong (faithfulness, $P$-cyclicity) and ($P$-)regularity of acts imply the property $U$-($G$-$PWP$). Finally, we give a necessar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999